翻訳と辞書
Words near each other
・ Expanded memory
・ Expanded metal
・ Expanded Metropolitan Complex of São Paulo
・ Expanded orgasm
・ Expanded polystyrene concrete
・ Expanded Program on Immunization
・ Expanded Program on Immunization (Philippines)
・ Expanded Psionics Handbook
・ Expanded sheet metal
・ Expanded universe
・ Expanded Universe (Heinlein)
・ Expander
・ Expander (song)
・ Expander code
・ Expander cycle
Expander graph
・ Expander mixing lemma
・ Expander System Sweden AB
・ Expander walk sampling
・ Expanding Anyway
・ Expanding bullet
・ Expanding Earth
・ Expanding Human
・ Expanding Man
・ Expanding Monomers
・ Expanding nozzle
・ Expanding Senses
・ Expanding toy
・ Expando
・ ExpanDrive


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Expander graph : ウィキペディア英語版
Expander graph
In combinatorics, an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex, edge or spectral expansion as described below. Expander constructions have spawned research in pure and applied mathematics, with several applications to complexity theory, design of robust computer networks, and the theory of error-correcting codes.
==Definitions==
Intuitively, an expander is a finite, undirected multigraph in which every subset of the vertices that is not "too large" has a "large" boundary. Different formalisations of these notions give rise to different notions of expanders: ''edge expanders'', ''vertex expanders'', and ''spectral expanders'', as defined below.
A disconnected graph is not an expander, since the boundary of a connected component is empty. Every connected graph is an expander; however, different connected graphs have different expansion parameters. The complete graph has the best expansion property, but it has largest possible degree. Informally, a graph is a good expander if it has low degree and high expansion parameters.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Expander graph」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.